Comparing sat-based bounded model checking rtectl and ectl properties

A Comparison of SAT-Based and SMT-Based Bounded Model Checking Methods for ECTL

In this paper we present a comparison of the SAT-based bounded model checking (BMC) and SMT-based bounded model checking methods for ECTL properties of a parallel composition of transition systems. In the both methods we use the parallel composition (of the transition systems) based on the interleaved semantics. Moreover, the both methods use the same bounded semantics of ECTL formulae, the com...

Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking

Interpolation Properties and SAT-Based Model Checking

Craig interpolation is a widespread method in verification, with important applications such as Predicate Abstraction, CounterExample Guided Abstraction Refinement and Lazy Abstraction With Interpolants. Most state-of-the-art model checking techniques based on interpolation require collections of interpolants to satisfy particular properties, to which we refer as “collectives”; they do not hold...

SMT-based Bounded Model Checking for Weighted Interpreted Systems and for Weighted Epistemic ECTL

We define the SMT-based bounded model checking (BMC) method for Weighted Interpreted Systems and for the existential fragment of the Weighted Epistemic Computation Tree Logic. We implemented the new BMC algorithm and compared it with the SATbased BMC method for the same systems and the same property language on several benchmarks for multi-agent systems.

Benchmarking SAT Solvers for Bounded Model Checking

Modern SAT solvers are highly dependent on heuristics. Therefore, benchmarking is of prime importance in evaluating the performances of different solvers. However, relevant benchmarking is not necessarily straightforward. We present our experiments using the IBM CNF Benchmark on several SAT solvers. Using the results, we attempt to define guidelines for a relevant benchmarking methodology, usin...